Optimal pairs of incomparable clouds in multisets

نویسندگان

  • Rudolf Ahlswede
  • Levon H. Khachatrian
چکیده

We consider the partially ordered set ([k]", <), which is defined as n-th product of the chain [k] = {0,1, 2 . . . . . k 1}, and study pairs (A, B) of incomparable sets A, B ~ [k]", that is, a :g b, a :~ b for all a ~ A, b ~ B or (in short notation) A : :~ B. We are concerned with the growth of the functions f,: {0, 1 . . . . . k ~} ---, {0, 1 . . . . . k"}, n ~ N, defined by f,(ct) = max{IN: A,B c [k] * with Iat = ~ and A ~ B} and a characterisation of pairs (A, B), which assume this bound. In the previously studied case k = 2 our results are considerably sharper than earlier result s by Seymour, Hilton, Ahlswede and Zhang.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Cross-Disjoint Pairs of Clouds in the Interval Lattice

Let In be the lattice of intervals in the Boolean lattice Ln . For A;B In the pair of clouds (A;B) is cross{disjoint, if I \ J = for I 2 A , J 2 B . We prove that for such pairs jAjjBj 32n 2 and that this bound is best possible. Optimal pairs are up to obvious isomorphisms unique. The proof is based on a new bound on cross intersecting families in Ln with a weight distribution. It implies also ...

متن کامل

Decoy Bandits Dueling on a Poset

We adress the problem of dueling bandits defined on partially ordered sets, or posets. In this setting, arms may not be comparable, and there may be several (incomparable) optimal arms. We propose an algorithm, UnchainedBandits, that efficiently finds the set of optimal arms of any poset even when pairs of comparable arms cannot be distinguished from pairs of incomparable arms, with a set of mi...

متن کامل

General definitions for the union and intersection of ordered fuzzy multisets

Since its original formulation, the theory of fuzzy sets has spawned a number of extensions where the role of membership values in the real unit interval $[0, 1]$ is handed over to more complex mathematical entities. Amongst the many existing extensions, two similar ones, the fuzzy multisets and the hesitant fuzzy sets, rely on collections of several distinct values to represent fuzzy membershi...

متن کامل

ON GENERALIZED FUZZY MULTISETS AND THEIR USE IN COMPUTATION

An orthogonal approach to the fuzzification of both multisets and hybridsets is presented. In particular, we introduce $L$-multi-fuzzy and$L$-fuzzy hybrid sets, which are general enough and in spirit with thebasic concepts of fuzzy set theory. In addition, we study the properties ofthese structures. Also, the usefulness of these structures is examined inthe framework of mechanical multiset proc...

متن کامل

Dimension, Graph and Hypergraph Coloring

There is a natural way to associate with a poset P a hypergraph HP, called the hypergraph of incomparable pairs, so that the dimension of P is the chromatic number of HP. The ordinary graph GP of incomparable pairs determined by the edges in HP of size 2 can have chromatic number substantially less than HP. We give a new proof of the fact that the dimension of P is 2 if and only if GP is bipart...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Graphs and Combinatorics

دوره 12  شماره 

صفحات  -

تاریخ انتشار 1996